In‐Memory Eigenvector Computation in Time O (1)
نویسندگان
چکیده
منابع مشابه
Adaptive algorithms for first principal eigenvector computation
The paper presents a unified framework to derive and analyze 10 different adaptive algorithms, some well-known, to compute the first principal eigenvector of the correlation matrix of a random vector sequence. Since adaptive principal eigenvector algorithms have originated from a diverse set of disciplines, including ad hoc methods, it is necessary to examine them in a unified framework. In a c...
متن کاملEfficient coordinate-wise leading eigenvector computation
We develop and analyze efficient ”coordinatewise” methods for finding the leading eigenvector, where each step involves only a vector-vector product. We establish global convergence with overall runtime guarantees that are at least as good as Lanczos’s method and dominate it for slowly decaying spectrum. Our methods are based on combining a shift-and-invert approach with coordinate-wise algorit...
متن کاملImplementing regularization implicitly via approximate eigenvector computation
Regularization is a powerful technique for extracting useful information from noisy data. Typically, it is implemented by adding some sort of norm constraint to an objective function and then exactly optimizing the modified objective function. This procedure often leads to optimization problems that are computationally more expensive than the original problem, a fact that is clearly problematic...
متن کاملPrivacy Preserving Protocols for Eigenvector Computation
In this paper, we present a protocol for computing the principal eigenvector of a collection of data matrices belonging to multiple semi-honest parties with privacy constraints. Our proposed protocol is based on secure multi-party computation with a semi-honest arbitrator who deals with data encrypted by the other parties using an additive homomorphic cryptosystem. We augment the protocol with ...
متن کاملA subspace preconditioning algorithm for eigenvector/eigenvalue computation
We consider the problem of computing a modest number of the smallest eigenvalues along with orthogonal bases for the corresponding eigenspaces of a symmetric positive definite operator A defined on a finite dimensional real Hilbert space V . In our applications, the dimension of V is large and the cost of inverting A is prohibitive. In this paper, we shall develop an effective parallelizable te...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advanced Intelligent Systems
سال: 2020
ISSN: 2640-4567,2640-4567
DOI: 10.1002/aisy.202000042